A geometric approach to orbital recognition in Chevalley-type coherent configurations and association schemes
نویسندگان
چکیده
We say that a coherent configuration is of Chevalley type if its basis relations correspond to orbitals of a geometric action (G,Ω), where G is a finite Chevalley group. If the action is transitive, the resulting configuration is an association scheme. In this paper, we seek to provide an effective universal strategy for orbital recognition in coherent configurations of Chevalley type. This must be preceded by a universal orbital characterization strategy, which we also propose. There are a number of ways to represent the objects in Ω to enable orbital recognition but, invariably, these strategies depend on the structure of the ambient group. On the other hand, a universal strategy does exist, which involves a canonical embedding of Ω in the flag geometry F(G) of G, however this strategy alone does not facilitate fast orbital recognition. In this paper, we further identify these embedded objects in F(G) with certain distinguished elements in the upper Borel subalgebra L of the Lie algebra for G. This reduces orbital recognition to an investigation of systems of equations that arise from vanishing of the Lie product in L . In many instances these systems of equations turn out to be linear. ∗ Both authors were supported by NSF grant DMS–9115473 † Supported by NSF grant DMS–9304580 V. USTIMENKO AND A. WOLDAR/AUSTRALAS. J. COMBIN. 67 (2) (2017), 166–202 167
منابع مشابه
Coherent configurations, association schemes and permutation groups
Coherent configurations are combinatorial objects invented for the purpose of studying finite permutation groups; every permutation group which is not doubly transitive preserves a non-trivial coherent configuration. However, symmetric coherent configurations have a much longer history, having been used in statistics under the name of association schemes. The relationship between permutation gr...
متن کاملRecognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes
In this paper we present a time-polynomial recognition algorithm for certain classes of circulant graphs. Our approach uses coherent configurations and Schur rings generated by circulant graphs for elucidating their symmetry properties and eventually finding a cyclic automorphism.
متن کاملDeveloping a Priority-Based Decision Making Method to Evaluate Geometric Configuration of Urban Interchanges
The present article involves in evaluation and engineering judgment of various geometric configurations for highway interchanges by considering substantial parameters over the discretion process. The geometric, economical and architectural criteria as the fundamental indicators are divided into related sub-indicators and the total combinations of such sub-elements from the general criterion for...
متن کاملAssociation schemes and permutation groups
A set of zero-one matrices satisfying (CC1)–(CC4) is called a coherent configuration. It is really a combinatorial object, since the conditions on the matrices can be translated into combinatorial conditions on the binary relations Oi. The coherent configuration formed by the orbital matrices of a permutation group G is the orbital configuration of G. Indeed, a coherent configuration is a parti...
متن کاملNew Shewhart-type synthetic bar{X} control schemes for non-normal data
In this paper, Burr-type XII ̄X synthetic schemes are proposed as an alternative to the classical ̄X synthetic schemes when the assumption of normality fails to hold. First, the basic design of the Burr-type XII ̄X synthetic scheme is developed and its performance investigated using exact formulae. Secondly, the non-side-sensitive and side-sensitive Burr-type XII ̄X synthetic schemes are int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 67 شماره
صفحات -
تاریخ انتشار 2017